Non-crossing Partition Lattices in Finite Real Reflection Groups
نویسندگان
چکیده
For a finite real reflection group W with Coxeter element γ we give a case-free proof that the closed interval, [I, γ], forms a lattice in the partial order on W induced by reflection length. Key to this is the construction of an isomorphic lattice of spherical simplicial complexes. We also prove that the greatest element in this latter lattice embeds in the type W simplicial generalised associahedron, and we use this fact to give a new proof that the geometric realisation of this associahedron is a sphere.
منابع مشابه
Geometrically Constructed Bases for Homology of Non-Crossing Partition Lattices
For any finite, real reflection group W , we construct a geometric basis for the homology of the corresponding non-crossing partition lattice. We relate this to the basis for the homology of the corresponding intersection lattice introduced by Björner and Wachs in [4] using a general construction of a generic affine hyperplane for the central hyperplane arrangement defined by W .
متن کاملShellability of Noncrossing Partition Lattices
We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type Dn and those of exceptional type and rank at least three.
متن کاملLattices in Finite Real Reflection Groups Thomas Brady and Colum Watt
For a finite real reflection group W with Coxeter element γ we give a uniform proof that the closed interval, [I, γ] forms a lattice in the partial order on W induced by reflection length. The proof involves the construction of a simplicial complex which can be embedded in the type W simplicial generalised associahedron.
متن کاملFrom Permutahedron to Associahedron
For each finite real reflection group W , we identify a copy of the type-W simplicial generalised associahedron inside the corresponding simplicial permutahedron. This defines a bijection between the facets of the generalised associahedron and the elements of the type W non-crossing partition lattice which is more tractable than previous such bijections. We show that the simplicial fan determin...
متن کاملAn Introduction to Garside Structures
Geometric combinatorialists often study partially ordered sets in which each covering relation has been assigned some sort of label. In this article we discuss how each such labeled poset naturally has a monoid, a group, and a cell complex associated with it. Moreover, when the labeled poset satisfies three simple combinatorial conditions, the connections among the poset, monoid, group, and com...
متن کامل